On Manin's conditional algorithm

The Conditional Lucas & Kanade Algorithm

The Lucas-Kanade (LK) algorithm is the method of choice for efficient dense image and object alignment. The approach is efficient as it attempts to model the connection between appearance and geometric displacement through a linear relationship that assumes independence across pixel coordinates. A drawback of the approach, however, is its generative nature. Specifically, its performance is tigh...

Indoor Pedestrian Navigation Based on Conditional Random Field Algorithm

Foot-mounted micro-electromechanical systems (MEMS) inertial sensors based on pedestrian navigation can be used for indoor localization. We previously developed a novel zero-velocity detection algorithm based on the variation in speed over a gait cycle, which can be used to correct positional errors. However, the accumulation of heading errors cannot be corrected and thus, the system suffers fr...

A derivative-free optimization algorithm based on conditional moments

In this paper we propose a derivative-free optimization algorithm based on conditional moments for finding the maximizer of an objective function. The proposed algorithm does not require calculation or approximation of any order derivative of the objective function. The step size in iteration is determined adaptively according to the local geometrical feature of the objective function and a pre...

A Unifying Algorithm for Conditional, Probabilistic Planning

Several recent papers describe algorithms for generating conditional and/or probabilistic plans. In this paper, we synthesize this work, and present a unifying algorithm that incorporates and clarifies the main techniques that have been developed in the previous literature. Our algorithm decouples the search-control strategy for conditional and/or probabilistic planning from the underlying plan...

The TM Algorithm for Maximisinga Conditional Likelihood